A New Method of Learning Weighted Similarity Function to Improve Predictions of Nearest Neighbor Rule

نویسندگان

  • M. Zolghadri Jahromi
  • E. Parvinnia
چکیده

classifier is highly dependant on the distance (or similarity) function used to find the NN of an input test pattern. In order to optimize the accuracy of the NN rule, a weighted similarity function is proposed. In this scheme, a weight is assigned to each training instance. The weights of training instances are used in the generalization phase to find the NN of an input test pattern. To specify the weights of training instances, we propose a learning algorithm that attempts to minimize the leave-one-out (LV1) error rate of the classifier on train data. The proposed approach is assessed using a number of data sets from UCI corpora. Simulation results show that the proposed method improves the generalization accuracy of the basic NN and results are comparable to or better than other methods proposed in the past to learn the distance function.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A method of learning weighted similarity function to improve the performance of nearest neighbor

The performance of Nearest Neighbor (NN) classifier is known to be sensitive to the distance (or similarity) function used in classifying a test instance. Another major disadvantage of NN is that it uses all training instances in the generalization phase. This can cause slow execution speed and high storage requirement when dealing with large datasets. In the past research, many solutions have ...

متن کامل

Induced OWA Aggregation in Case Based Reasoning

We discuss the role of nearest neighbor The nearest neighbor method can essential be seen technologies in case based reasoning. We describe the to involve a two step process. The first step in the use of the ordered weighted averaging for the nearest neighbor approach is to calculate the similarity development of nearest neighbor rules. A procedure for of the object of interest to each of the o...

متن کامل

A New Hybrid Approach of K-Nearest Neighbors Algorithm with Particle Swarm Optimization for E-Mail Spam Detection

Emails are one of the fastest economic communications. Increasing email users has caused the increase of spam in recent years. As we know, spam not only damages user’s profits, time-consuming and bandwidth, but also has become as a risk to efficiency, reliability, and security of a network. Spam developers are always trying to find ways to escape the existing filters therefore new filters to de...

متن کامل

Instance Similarity Deep Hashing for Multi-Label Image Retrieval

Hash coding has been widely used in the approximate nearest neighbor search for large-scale image retrieval. Recently, many deep hashing methods have been proposed and shown largely improved performance over traditional featurelearning-based methods. Most of these methods examine the pairwise similarity on the semantic-level labels, where the pairwise similarity is generally defined in a hard-a...

متن کامل

Edge Detection Based On Nearest Neighbor Linear Cellular Automata Rules and Fuzzy Rule Based System

 Edge Detection is an important task for sharpening the boundary of images to detect the region of interest. This paper applies a linear cellular automata rules and a Mamdani Fuzzy inference model for edge detection in both monochromatic and the RGB images. In the uniform cellular automata a transition matrix has been developed for edge detection. The Results have been compared to the ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008